On languages specified by relative acceptance
نویسندگان
چکیده
منابع مشابه
On the Acceptance Power of Regular Languages
Hertrampf et al. (1993) looked at complexity classes which are characterized (say accepted) by a regular language for the words of output bits produced by nondeterministic polynomial-time computations. A number of well-known complexity classes between P and PSPACE are accepted by regular languages. For example, NP is accepted by the regular language which consists of the words which contain at ...
متن کاملGenerating Visual Editors for Formally Specified Languages
We discuss the generation of structured visual editors for formally speciied languages. We use the term structured visual editor to refer to a structure{oriented editor which provides language speciic behavior and supports the interactive construction of programs. This paper describes how such a visual editor can be generated from a formal language speciication including the language's visual s...
متن کاملAcceptance Conditions for ω-Languages
This paper investigates acceptance conditions for nite automata recognizing ω-regular languages. Their expressive power and their position w.r.t. the Borel hierarchy is also studied. The full characterization for the conditions (ninf,u), (ninf,⊆) and (ninf,=) is given. The nal section provides a partial characterization of (fin,=).
متن کاملAcceptance of -Languages by Communicating Deterministic Turing Machines
Using a specific model of communicating deterministic Turing machines we prove that the class of -languages accepted by deterministic Turing machines via complete non-oscillating (complete oscillating) runs on the input coincides with the class of -definable ( -definable, respectively) -languages. email: [email protected] email: [email protected] 2 R. Freund and L. Staiger
متن کاملRelative Prefix Distance Between Languages
The prefix distance between two words x and y is defined as the number of symbols in x and y that do not belong to their longest common prefix. The relative prefix distance from a language L1 to a language L2, if finite, is the smallest integer k such that for every word in L1, there is a word in L2 with prefix distance at most k. We study the prefix distance between regular, visibly pushdown, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1978
ISSN: 0304-3975
DOI: 10.1016/0304-3975(78)90048-8